Evaluating the noise resilience of variational quantum algorithms
نویسندگان
چکیده
We simulate the effects of different types noise in state preparation circuits variational quantum algorithms. first use a eigensolver to find ground Hamiltonian presence noise, and adopt two quality measures addition energy, namely fidelity concurrence. then extend task one constructing, with layered circuit ansatz, set general random target states. determine optimal depth for levels observe that algorithms mitigate by adapting optimised parameters. inclusion redundant parameterised gates makes more resilient noise. For such overparameterised sets parameters can result same final noiseless case, which we denote as parameter degeneracy. Numerically, show this degeneracy be lifted some states being significantly than others. also average deviation from is linear level, long small compared circuit-dependent threshold. In region well described stochastic model. Above threshold, optimisation converge largely physical properties true state, so practical applications it critical ensure are below
منابع مشابه
Towards Practical Quantum Variational Algorithms
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be executed without quantum error correction. Such quantum state preparation can be used in variational approaches, optimizing parameters in the circuit to minimi...
متن کاملResilience to Time-Correlated Noise in Quantum Computation
Building a quantum computer amounts to attaining exquisite control of a large quantum system. In particular, it requires quantum systems that (i) are isolated from the rest of the Universe and (ii) can be arbitrarily manipulated, all with any desired accuracy. A priori, quantum systems naturally displaying this unlikely combination of characteristics might exist [1]. Unfortunately, for the time...
متن کاملQuantum Algorithms for Evaluating Min-MaxTrees
We present a bounded-error quantum algorithm for evaluating Min-Max trees with N 1 2+o(1) queries, where N is the size of the tree and where the allowable queries are comparisons of the form [xj < xk]. This is close to tight, since there is a known quantum lower bound of
متن کاملOptimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
Zhi-Cheng Yang,1 Armin Rahmani,2, 3 Alireza Shabani,4 Hartmut Neven,4 and Claudio Chamon1 1Physics Department, Boston University, Boston, Massachusetts 02215, USA 2Department of Physics and Astronomy and Quantum Matter Institute, University of British Columbia, Vancouver, British Columbia, Canada V6T 1Z4 3Department of Physics and Astronomy, Western Washington University, 516 High Street, Belli...
متن کاملEvaluating the Error Resilience of GPGPU Applications
Over the past years, GPUs (Graphics Processing Units) have gained wide adoption as accelerators for general purpose computing. A number of studies [1, 2] have shown that significant performance gains can be achieved by deploying GPUs on traditional high performance computing (HPC) systems that host demanding scientific applications. However, the reliability implications of using GPUs are unclea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review
سال: 2021
ISSN: ['0556-2813', '1538-4497', '1089-490X']
DOI: https://doi.org/10.1103/physreva.104.022403